VLF/LF大气噪声模拟

由于无线电大气噪声所涉及的现象非常复杂,观测结果又具有局限性,所以它的理论分析比较困难。本文通过对大气噪声特性的分析,指出影响大气噪声的主要参数,并利用噪声特征经典分析模型建立了仿真模型。最后对模拟数值和实测数据进行了比较,结果证明,模拟数据与观测数据有较好的一致性。     

搜索状态下相控阵雷达抗干扰能力评估

针对现有评估指标不能全面反映相控阵雷达在搜索状态下的抗干扰能力的问题,提出了利用搜索效率抗干扰改善因子这一综合指标来衡量相控阵雷达搜索状态下的抗干扰能力的方法.建立了在有源噪声干扰下搜索概率计算模型以及采用脉冲累积和累积检测技术后搜索概率的计算模型,通过分析脉冲累积数N和累积检测数M的关系,给出求解最大搜索效率的方法,最后通过实例仿真和结果分析,表明该方法计算简单,科学高效.     

末制导雷达抗干扰性能评估系统工程实现

噪声干扰是现代电子对抗中对付雷达的主要干扰形式之一。在压制式噪声干扰下,制导雷达无法提取目标角度等信息,使雷达失去工作能力。现代雷达工作者采用多种方法已研制出多种抗压制干扰的雷达。为了验证雷达的抗干扰性能,一套工程上易于实现的、实用性强的雷达压制干扰系统成为抗压制干扰雷达生产应用的必要检验手段。     

具有变时滞的离散型随机BAM神经网络的稳定性

研究一类具有变时滞的离散型随机BAM神经网络。通过构造Lyapunov泛函以及线性矩阵不等式（LMI）,得出了离散系统全局渐近稳定的充分条件。     

基于随机网络的平均维修保障服务时间分析

利用随机网络建模方法在随机工程项目分析中的优越性,建立了不同保障方式下的维修保障过程模型。重点对网络活动中的维修等待时间和维修等待概率进行了分析,利用随机网络的解析算法,确定了维修力量的平均维修保障服务时间分析模型。最后将该方法应用于伴随修理过程,对其平均维修保障服务时间进行了案例分析。     

北斗三号新信号体制共视时间比对

为促使北斗系统特别是北斗三号系统尽早加入国际原子时计算,利用中国科学院国家授时中心以及捷克无线电工程和电子学院两个守时实验室接收机产生的北斗三号新信号体制观测数据,开展基于北斗三号新信号体制共视时间比对试验。结果表明,北斗三号信号的多路径噪声影响小于北斗二号信号,且信噪比优于北斗二号信号。对比已有的研究,北斗三号新信号体制(B1C和B2a)共视时间比对的噪声相对于北斗三号卫星播发的北斗二号兼容信号体制(B1I和B3I)有较大的改善,其结果与GPS、Galileo共视比对结果相当,且在零基线共钟比对中,基于北斗三号新信号体制比对钟差的标准偏差相对于北斗二号信号提高了40%以上;利用北斗三号新信号体制共视得到的亚欧两地钟差噪声小于北斗二号信号,且比对钟差的稳定度相对于北斗二号提高了10%以上。该试验也可为北斗三号时间比对纳入国际原子时计算提供相关的研究基础。     

内燃机噪声控制的现状与发展

军用装备动力设备噪声过大严重影响指战员的通讯,对身心会造成严重的伤害.介绍了内燃机噪声控制技术的发展过程和最新技术,对隔声罩的设计作了较为详细的阐述.针对军用装备动力设备噪声过大的问题,提出采用隔声罩是较为行之有效的处理方法.     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005